Designing Pattern Matching Algorithms by Exploiting Structural Pattern Properties
نویسنده
چکیده
منابع مشابه
Using the Adaptive Frequency Nonlinear Oscillator for Earning an Energy Efficient Motion Pattern in a Leg- Like Stretchable Pendulum by Exploiting the Resonant Mode
In this paper we investigate a biological framework to generate and adapt a motion pattern so that can be energy efficient. In fact, the motion pattern in legged animals and human emerges among interaction between a central pattern generator neural network called CPG and the musculoskeletal system. Here, we model this neuro - musculoskeletal system by means of a leg - like mechanical system cal...
متن کاملOn Applying Fast and Efficient Methods in Pattern Recognition
This chapter presents a new approach in pattern recognition which relies on using fast and efficient techniques in the implementation of basic pattern recognition procedures. More specifically, concerning the pattern preprocessing and feature extraction stage, a novel method is employed in the design of the relevant algorithms. Namely, the Image Block Representation methodology is used in the c...
متن کاملFast XML Structural Join Algorithms by Partitioning
An XML structural join evaluates structural relationships (e.g. parent-child or ancestordescendant) between XML elements. It serves as an important computation unit in XML pattern matching. Several classical structural join algorithms have been proposed such as Stack-tree join and XR-Tree join. In this paper, we consider to answer the problem of structural join by partitioning. The Dietz number...
متن کاملDesigning optimal- and fast-on-average pattern matching algorithms
Given a pattern w and a text t, the speed of a pattern matching algorithm over t with regard to w, is the ratio of the length of t to the number of text accesses performed to search w into t. We first propose a general method for computing the limit of the expected speed of pattern matching algorithms, with regard to w, over iid texts. Next, we show how to determine the greatest speed which can...
متن کاملA Simple ( but Optimal ) 2 D -
The duel paradigm appeared in the recent years as crucial to design eecient 1D or 2D pattern matching algorithms. It relies on the computation of witnesses, i.e. mismatching positions between two overlapping copies of a pattern p searched in a text t. Although this is easily done in linear time in 1D, the two previous algorithms in 2D rely on quite intricate data structures. We prove new struct...
متن کامل